<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    92. Reverse Linked List II
   </h1>
   <p>
    Reverse a linked list from position
    <em>
     m
    </em>
    to
    <em>
     n
    </em>
    . Do it in one-pass.
   </p>
   <p>
    <strong>
     Note:&nbsp;
    </strong>
    1 &le;
    <em>
     m
    </em>
    &le;
    <em>
     n
    </em>
    &le; length of list.
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;NULL, <em>m</em> = 2, <em>n</em> = 4
<strong>Output:</strong> 1-&gt;4-&gt;3-&gt;2-&gt;5-&gt;NULL
</pre>
  </div>
  <div>
   <h1 class="question_title">
    92. 反转链表 II
   </h1>
   <p>
    反转从位置
    <em>
     m
    </em>
    到
    <em>
     n
    </em>
    的链表。请使用一趟扫描完成反转。
   </p>
   <p>
    <strong>
     说明:
    </strong>
    <br>
    1 &le;&nbsp;
    <em>
     m
    </em>
    &nbsp;&le;&nbsp;
    <em>
     n
    </em>
    &nbsp;&le; 链表长度。
   </p>
   <p>
    <strong>
     示例:
    </strong>
   </p>
   <pre><strong>输入:</strong> 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;NULL, <em>m</em> = 2, <em>n</em> = 4
<strong>输出:</strong> 1-&gt;4-&gt;3-&gt;2-&gt;5-&gt;NULL</pre>
  </div>
 </body>
</html>